Markov Chain Monte Carlo Algorithms Allowing Parallel Processing -II
نویسندگان
چکیده
منابع مشابه
Markov Chain Monte Carlo Algorithms Allowing Parallel Processing –II
A variant of the Metropolis-Rosenbluth-Teller algorithm that allows parallel processing has been described in a previous paper (“Markov Chain Monte Carlo Calculations Allowing Parallel Processing Using a Variant of the Metropolis Algorithm”) that appeared in this journal in 2010. In this follow-on paper, the new algorithm as well as the MetropolisRosenbluth-Teller and Barker algorithms are anal...
متن کاملOn Adaptive Markov Chain Monte Carlo Algorithms
Abstract We look at adaptive MCMC algorithms that generate stochastic processes based on sequences of transition kernels, where each transition kernel is allowed to depend on the past of the process. We show under certain conditions that the generated stochastic process is ergodic, with appropriate stationary distribution. We then consider the Random Walk Metropolis (RWM) algorithm with normal ...
متن کاملSpeeeding Up Markov Chain Monte Carlo Algorithms
We prove an upper bound on the convergence rate of Markov Chain Monte Carlo (MCMC) algorithms for the important special case when the state space can be aggregated into a smaller space, such that the aggregated chain approximately preserves the Markov property.
متن کاملMarkov Chain Monte Carlo
Markov chain Monte Carlo is an umbrella term for algorithms that use Markov chains to sample from a given probability distribution. This paper is a brief examination of Markov chain Monte Carlo and its usage. We begin by discussing Markov chains and the ergodicity, convergence, and reversibility thereof before proceeding to a short overview of Markov chain Monte Carlo and the use of mixing time...
متن کاملMarkov Chain Monte Carlo
This paper gives a brief introduction to Markov Chain Monte Carlo methods, which offer a general framework for calculating difficult integrals. We start with the basic theory of Markov chains and build up to a theorem that characterizes convergent chains. We then discuss the MetropolisHastings algorithm.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Open Numerical Methods Journal
سال: 2011
ISSN: 1876-3898
DOI: 10.2174/1876389801103010012